0.00/0.01	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.01	% app-encoded or not : original
0.00/0.01	% Variant    : supatvars_ext
0.00/0.01	% Ordering    : kbo
0.00/0.01	% Command    : 
0.00/0.01	#!/bin/sh
0.00/0.01	
0.00/0.01	./zipperposition.native ${1:+"$1"} \
0.00/0.01	  -i tptp \
0.00/0.01	  -o tptp \
0.00/0.01	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.01	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.01	  --no-avatar \
0.00/0.01	  --ho \
0.00/0.01	  --force-ho \
0.00/0.01	  --no-ho-elim-pred-var \
0.00/0.01	  --ho-general-ext-pos \
0.00/0.01	  --no-ho-unif \
0.00/0.01	  --no-induction \
0.00/0.01	  --no-unif-pattern \
0.00/0.01	  --ord $2  \
0.00/0.01	  --simultaneous-sup false \
0.00/0.01	  --sup-at-vars \
0.00/0.01	  --restrict-hidden-sup-at-vars \
0.00/0.01	  --ho-ext-axiom \
0.00/0.01	  --ho-prim-enum none \
0.00/0.01	  --no-max-vars \
0.00/0.01	  --dont-select-ho-var-lits \
0.00/0.01	  --no-fool
0.00/0.20	% Computer   : n097.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 18:35:38 CST 2018
0.00/0.21	% done 5 iterations in 0.004s
0.00/0.21	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.21	% SZS output start Refutation
0.00/0.21	tff('thm/sets/SUBSET_DIFF_', axiom,
0.00/0.21	  (![A:$tType,A0:(A > $o),A1:(A > $o)]:
0.00/0.21	     'const/sets/SUBSET'(A,'const/sets/DIFF'(A,A0,A1),A0))).
0.00/0.21	tff('0', plain,
0.00/0.21	    ![X0 : $tType, X1 : X0 > $o, X2 : X0 > $o]:
0.00/0.21	      'const/sets/SUBSET'(X0, 'const/sets/DIFF'(X0, X1, X2), X1),
0.00/0.21	    inference('cnf', [status(esa)], [thm/sets/SUBSET_DIFF_])).
0.00/0.21	tff('thm/sets/FINITE_SUBSET_', axiom,
0.00/0.21	  (![A:$tType,A0:(A > $o),A1:(A > $o)]:
0.00/0.21	     (('const/sets/SUBSET'(A,A0,A1) & 'const/sets/FINITE'(A,A1)) =>
0.00/0.21	      'const/sets/FINITE'(A,A0)))).
0.00/0.21	tff('1', plain,
0.00/0.21	    ![X3 : $tType, X4 : X3 > $o, X5 : X3 > $o]:
0.00/0.21	      ('const/sets/FINITE'(X3, X4)
0.00/0.21	       | ~ 'const/sets/SUBSET'(X3, X4, X5)
0.00/0.21	       | ~ 'const/sets/FINITE'(X3, X5)),
0.00/0.21	    inference('cnf', [status(esa)], [thm/sets/FINITE_SUBSET_])).
0.00/0.21	tff('2', plain,
0.00/0.21	    ![X0 : $tType, X1 : X0 > $o, X2 : X0 > $o]:
0.00/0.21	      (~ $true
0.00/0.21	       | ~ 'const/sets/FINITE'(X0, X1)
0.00/0.21	       | 'const/sets/FINITE'(X0, 'const/sets/DIFF'(X0, X1, X2))),
0.00/0.21	    inference('sup-', [status(thm)], ['0', '1'])).
0.00/0.21	tff('3', plain,
0.00/0.21	    ![X0 : $tType, X1 : X0 > $o, X2 : X0 > $o]:
0.00/0.21	      ('const/sets/FINITE'(X0, 'const/sets/DIFF'(X0, X1, X2))
0.00/0.21	       | ~ 'const/sets/FINITE'(X0, X1)),
0.00/0.21	    inference('simplify', [status(thm)], ['2'])).
0.00/0.21	tff('thm/sets/FINITE_DIFF_', conjecture,
0.00/0.21	  (![A:$tType,A0:(A > $o),A1:(A > $o)]:
0.00/0.21	     ('const/sets/FINITE'(A,A0) =>
0.00/0.21	      'const/sets/FINITE'(A,'const/sets/DIFF'(A,A0,A1))))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture,
0.00/0.21	  (~
0.00/0.21	    (![A:$tType,A0:(A > $o),A1:(A > $o)]:
0.00/0.21	       ('const/sets/FINITE'(A,A0) =>
0.00/0.21	        'const/sets/FINITE'(A,'const/sets/DIFF'(A,A0,A1)))))).
0.00/0.21	tff('4', plain,
0.00/0.21	    ~ 'const/sets/FINITE'(sk_A, 'const/sets/DIFF'(sk_A, sk_A0, sk_A1)),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('5', plain, (~ $true | ~ 'const/sets/FINITE'(sk_A, sk_A0)),
0.00/0.21	    inference('sup-', [status(thm)], ['3', '4'])).
0.00/0.21	tff('6', plain, 'const/sets/FINITE'(sk_A, sk_A0),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('7', plain, (~ $true | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['5', '6'])).
0.00/0.21	tff('8', plain, $false, inference('simplify', [status(thm)], ['7'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.22	EOF
